Description: 本文件含论文及源代码。论文首先介绍了基本遗传算法的基本原理、特点及其基本实现技术，接着针对背包问题，论述了遗传算法在编码表示和遗传算子（包括选择算子、交叉算子变异算子这三种算子）等方面的应用情况。并且结合背包问题实例，给出了具体的编码方法，运行参数，群体大小，最大迭代次数，以及合适的遗传算子。最后，简单说明了遗传算法在求解背包问题中的应用并对遗传算法解决背包问题的前景提出了展望。-The file containing the papers and source code. The paper first introduces the basic principles of the basic genetic algorithm, the characteristics of its basic implementation techniques, and then for the knapsack problem, discusses the genetic algorithm coded representation and genetic operators (including selection operator, crossover operator mutation operator three count sub), and other aspects of the application. And the combination of an instance of the knapsack problem, given specific encoding method, operating parameters, population size, maximum number of iterations, and appropriate genetic operators. Finally, a brief description of the genetic algorithm Knapsack problem and genetic algorithm to solve the knapsack problem prospects prospect. Platform: |
Size: 420864 |
Author:李海波 |
Hits:
Description: 回溯法、分支限界法的原理，并能够按其原理编程实现解决0-1背包问题，以加深对回溯法、分支限界法的理解。 -Backtracking, branch and bound method principle, and can according to the principle of programming to realize solving knapsack problem, in order to deepen our understanding of the backtracking, branch and bound method understanding.
Platform: |
Size: 90112 |
Author:丁 |
Hits:
Description: 本次实验选择0-1背包问题作为题目，通过使用动态规划、回溯法和分支定界法等算法来求解该问题，从而进一步的了解各种算法的原理、思路及其本质，深化对算法的了解，锻炼自己对各种算法的分析和使用，熟悉软件底层算法和界面编程。-The 0-1 knapsack problem was chosen as the subject, through the use of dynamic programming, backtracking and branch and bound method algorithm to solve the problem, so as to further the understanding of the principles of various algorithms, ideas and nature, deepening of the algorithm Learn to exercise their own analysis of the various algorithms and use familiar with the software underlying algorithms and programming interface. Platform: |
Size: 202752 |
Author:invest |
Hits:
Description: 背包问题的变形，可以更好的理解，01背包，完全背包，多重背包问题等问题-Deformation knapsack problem can be better understood, 01 backpacks, completely backpack, multiple knapsack problem and other issues Platform: |
Size: 49152 |
Author:宋 |
Hits:
Description: 代码实现的是背包问题的解决，背包问题是经典的算法问题。-Code is to solve the knapsack problem, knapsack problem is a classical algorithm for the problem. Platform: |
Size: 30720 |
Author: |
Hits:
Description: 0-1背包问题解决机组组合问题（给定N中物品和一个背包。物品i的重量是Wi,其价值位Vi ，背包的容量为C。问应该如何选择装入背包的物品，使得转入背包的物品的总价值为最大？？
在选择物品的时候，对每种物品i只有两种选择，即装入背包或不装入背包。不能讲物品i装入多次，也不能只装入物品的一部分。因此，该问题被称为0-1背包问题。
）-0-1 knapsack problem solving unit commitment problem (in a given N items and a backpack. Weight of the items i is Wi, the value of bit Vi, knapsack capacity C. Ask how to choose the items into the backpack, making the turn The total value of goods for the biggest backpack?? when selecting items for each item i have only two choices, that is loaded or not loaded backpack backpack. items i can not speak loading times, can not just load part of the article, so the problem is called 0-1 knapsack problem.) Platform: |
Size: 1024 |
Author:王林 |
Hits:
Description: 求解背包问题
从根目录下的systemconfig.ini文件获取数据
结果以图表方式显示-To solve the knapsack problem
Get data from systemconfig.ini at root directory
Results display in graph Platform: |
Size: 6318080 |
Author:zh |
Hits:
Search - knapsack problem